TSTP Solution File: DAT334^23 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : DAT334^23 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 22:11:11 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : DAT334^23 : TPTP v8.1.2. Released v8.1.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 24 14:36:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 %----Proving TH0
% 0.22/0.49 %------------------------------------------------------------------------------
% 0.22/0.49 % File : DAT334^23 : TPTP v8.1.2. Released v8.1.0.
% 0.22/0.49 % Domain : Data Structures
% 0.22/0.49 % Problem : Database querying
% 0.22/0.49 % Version : [BP13] axioms.
% 0.22/0.49 % English :
% 0.22/0.49
% 0.22/0.49 % Refs : [Rei92] Reiter (1992), What Should a Database Know?
% 0.22/0.49 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.22/0.49 % : [BP13] Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.22/0.49 % : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.22/0.49 % Source : [TPTP]
% 0.22/0.49 % Names : APM009+1 [QMLTP]
% 0.22/0.49
% 0.22/0.49 % Status : Theorem
% 0.22/0.49 % Rating : 0.31 v8.1.0
% 0.22/0.49 % Syntax : Number of formulae : 37 ( 12 unt; 21 typ; 10 def)
% 0.22/0.49 % Number of atoms : 46 ( 10 equ; 0 cnn)
% 0.22/0.49 % Maximal formula atoms : 10 ( 2 avg)
% 0.22/0.49 % Number of connectives : 75 ( 1 ~; 1 |; 5 &; 62 @)
% 0.22/0.49 % ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% 0.22/0.49 % Maximal formula depth : 10 ( 3 avg)
% 0.22/0.49 % Number of types : 3 ( 1 usr)
% 0.22/0.49 % Number of type conns : 62 ( 62 >; 0 *; 0 +; 0 <<)
% 0.22/0.49 % Number of symbols : 21 ( 20 usr; 7 con; 0-3 aty)
% 0.22/0.49 % Number of variables : 38 ( 25 ^; 10 !; 3 ?; 38 :)
% 0.22/0.49 % SPC : TH0_THM_EQU_NAR
% 0.22/0.49
% 0.22/0.49 % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.22/0.49 % version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.22/0.49 % 'modal' embedding, version 1.5.2. Logic specification used:
% 0.22/0.49 % $modal == [$constants == $rigid,$quantification == $decreasing,
% 0.22/0.49 % $modalities == $modal_system_S5].
% 0.22/0.49 %------------------------------------------------------------------------------
% 0.22/0.49 thf(mworld,type,
% 0.22/0.49 mworld: $tType ).
% 0.22/0.49
% 0.22/0.49 thf(mrel_type,type,
% 0.22/0.49 mrel: mworld > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mactual_type,type,
% 0.22/0.49 mactual: mworld ).
% 0.22/0.49
% 0.22/0.49 thf(mlocal_type,type,
% 0.22/0.49 mlocal: ( mworld > $o ) > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mlocal_def,definition,
% 0.22/0.49 ( mlocal
% 0.22/0.49 = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mnot_type,type,
% 0.22/0.49 mnot: ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mand_type,type,
% 0.22/0.49 mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mor_type,type,
% 0.22/0.49 mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mimplies_type,type,
% 0.22/0.49 mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mequiv_type,type,
% 0.22/0.49 mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mnot_def,definition,
% 0.22/0.49 ( mnot
% 0.22/0.49 = ( ^ [A: mworld > $o,W: mworld] :
% 0.22/0.49 ~ ( A @ W ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mand_def,definition,
% 0.22/0.49 ( mand
% 0.22/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.22/0.49 ( ( A @ W )
% 0.22/0.49 & ( B @ W ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mor_def,definition,
% 0.22/0.49 ( mor
% 0.22/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.22/0.49 ( ( A @ W )
% 0.22/0.49 | ( B @ W ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mimplies_def,definition,
% 0.22/0.49 ( mimplies
% 0.22/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.22/0.49 ( ( A @ W )
% 0.22/0.49 => ( B @ W ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mequiv_def,definition,
% 0.22/0.49 ( mequiv
% 0.22/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.22/0.49 ( ( A @ W )
% 0.22/0.49 <=> ( B @ W ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mbox_type,type,
% 0.22/0.49 mbox: ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mbox_def,definition,
% 0.22/0.49 ( mbox
% 0.22/0.49 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.22/0.49 ! [V: mworld] :
% 0.22/0.49 ( ( mrel @ W @ V )
% 0.22/0.49 => ( Phi @ V ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mdia_type,type,
% 0.22/0.49 mdia: ( mworld > $o ) > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(mdia_def,definition,
% 0.22/0.49 ( mdia
% 0.22/0.49 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.22/0.49 ? [V: mworld] :
% 0.22/0.49 ( ( mrel @ W @ V )
% 0.22/0.49 & ( Phi @ V ) ) ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(mrel_reflexive,axiom,
% 0.22/0.49 ! [W: mworld] : ( mrel @ W @ W ) ).
% 0.22/0.49
% 0.22/0.49 thf(mrel_euclidean,axiom,
% 0.22/0.49 ! [W: mworld,V: mworld,U: mworld] :
% 0.22/0.49 ( ( ( mrel @ W @ U )
% 0.22/0.49 & ( mrel @ W @ V ) )
% 0.22/0.49 => ( mrel @ U @ V ) ) ).
% 0.22/0.49
% 0.22/0.49 thf(eiw_di_type,type,
% 0.22/0.49 eiw_di: $i > mworld > $o ).
% 0.22/0.49
% 0.22/0.49 thf(eiw_di_nonempty,axiom,
% 0.22/0.49 ! [W: mworld] :
% 0.22/0.49 ? [X: $i] : ( eiw_di @ X @ W ) ).
% 0.22/0.49
% 0.22/0.49 thf(eiw_di_decr,axiom,
% 0.22/0.49 ! [W: mworld,V: mworld,X: $i] :
% 0.22/0.49 ( ( ( eiw_di @ X @ W )
% 0.22/0.49 & ( mrel @ V @ W ) )
% 0.22/0.50 => ( eiw_di @ X @ V ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mforall_di_type,type,
% 0.22/0.50 mforall_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mforall_di_def,definition,
% 0.22/0.50 ( mforall_di
% 0.22/0.50 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.22/0.50 ! [X: $i] :
% 0.22/0.50 ( ( eiw_di @ X @ W )
% 0.22/0.50 => ( A @ X @ W ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_di_type,type,
% 0.22/0.50 mexists_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_di_def,definition,
% 0.22/0.50 ( mexists_di
% 0.22/0.50 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.22/0.50 ? [X: $i] :
% 0.22/0.50 ( ( eiw_di @ X @ W )
% 0.22/0.50 & ( A @ X @ W ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(cs_decl,type,
% 0.22/0.50 cs: $i ).
% 0.22/0.50
% 0.22/0.50 thf(sue_decl,type,
% 0.22/0.50 sue: $i ).
% 0.22/0.50
% 0.22/0.50 thf(mary_decl,type,
% 0.22/0.50 mary: $i ).
% 0.22/0.50
% 0.22/0.50 thf(john_decl,type,
% 0.22/0.50 john: $i ).
% 0.22/0.50
% 0.22/0.50 thf(math_decl,type,
% 0.22/0.50 math: $i ).
% 0.22/0.50
% 0.22/0.50 thf(psych_decl,type,
% 0.22/0.50 psych: $i ).
% 0.22/0.50
% 0.22/0.50 thf(teach_decl,type,
% 0.22/0.50 teach: $i > $i > mworld > $o ).
% 0.22/0.50
% 0.22/0.50 thf(db,axiom,
% 0.22/0.50 ( mlocal
% 0.22/0.50 @ ( mbox
% 0.22/0.50 @ ( mand @ ( teach @ john @ math )
% 0.22/0.50 @ ( mand
% 0.22/0.50 @ ( mexists_di
% 0.22/0.50 @ ^ [X: $i] : ( teach @ X @ cs ) )
% 0.22/0.50 @ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(query,conjecture,
% 0.22/0.50 ( mlocal
% 0.22/0.50 @ ( mbox
% 0.22/0.50 @ ( mexists_di
% 0.22/0.50 @ ^ [X: $i] : ( teach @ X @ cs ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.annzRuD9ox/cvc5---1.0.5_5246.p...
% 0.22/0.50 (declare-sort $$unsorted 0)
% 0.22/0.50 (declare-sort tptp.mworld 0)
% 0.22/0.50 (declare-fun tptp.mrel (tptp.mworld tptp.mworld) Bool)
% 0.22/0.50 (declare-fun tptp.mactual () tptp.mworld)
% 0.22/0.50 (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.22/0.50 (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.22/0.50 (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.22/0.50 (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.22/0.50 (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.22/0.50 (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.22/0.50 (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.22/0.50 (declare-fun tptp.mbox ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (assert (= tptp.mbox (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.22/0.50 (declare-fun tptp.mdia ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (assert (= tptp.mdia (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.22/0.50 (assert (forall ((W tptp.mworld)) (@ (@ tptp.mrel W) W)))
% 0.22/0.50 (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel W))) (=> (and (@ _let_1 U) (@ _let_1 V)) (@ (@ tptp.mrel U) V)))))
% 0.22/0.50 (declare-fun tptp.eiw_di ($$unsorted tptp.mworld) Bool)
% 0.22/0.50 (assert (forall ((W tptp.mworld)) (exists ((X $$unsorted)) (@ (@ tptp.eiw_di X) W))))
% 0.22/0.50 (assert (forall ((W tptp.mworld) (V tptp.mworld) (X $$unsorted)) (let ((_let_1 (@ tptp.eiw_di X))) (=> (and (@ _let_1 W) (@ (@ tptp.mrel V) W)) (@ _let_1 V)))))
% 0.22/0.50 (declare-fun tptp.mforall_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (assert (= tptp.mforall_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (forall ((X $$unsorted)) (=> (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))
% 0.22/0.50 (declare-fun tptp.mexists_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.22/0.50 (assert (= tptp.mexists_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (exists ((X $$unsorted)) (and (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))
% 0.22/0.53 (declare-fun tptp.cs () $$unsorted)
% 0.22/0.53 (declare-fun tptp.sue () $$unsorted)
% 0.22/0.53 (declare-fun tptp.mary () $$unsorted)
% 0.22/0.53 (declare-fun tptp.john () $$unsorted)
% 0.22/0.53 (declare-fun tptp.math () $$unsorted)
% 0.22/0.53 (declare-fun tptp.psych () $$unsorted)
% 0.22/0.53 (declare-fun tptp.teach ($$unsorted $$unsorted tptp.mworld) Bool)
% 0.22/0.53 (assert (@ tptp.mlocal (@ tptp.mbox (@ (@ tptp.mand (@ (@ tptp.teach tptp.john) tptp.math)) (@ (@ tptp.mand (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.teach X) tptp.cs) __flatten_var_0)))) (@ (@ tptp.mand (@ (@ tptp.teach tptp.mary) tptp.psych)) (@ (@ tptp.teach tptp.sue) tptp.psych)))))))
% 0.22/0.53 (assert (not (@ tptp.mlocal (@ tptp.mbox (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.teach X) tptp.cs) __flatten_var_0)))))))
% 0.22/0.53 (set-info :filename cvc5---1.0.5_5246)
% 0.22/0.53 (check-sat-assuming ( true ))
% 0.22/0.53 ------- get file name : TPTP file name is DAT334^23
% 0.22/0.53 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_5246.smt2...
% 0.22/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.22/0.53 % SZS status Theorem for DAT334^23
% 0.22/0.53 % SZS output start Proof for DAT334^23
% 0.22/0.53 (
% 0.22/0.53 (let ((_let_1 (not (@ tptp.mlocal (@ tptp.mbox (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.teach X) tptp.cs) __flatten_var_0)))))))) (let ((_let_2 (@ tptp.mlocal (@ tptp.mbox (@ (@ tptp.mand (@ (@ tptp.teach tptp.john) tptp.math)) (@ (@ tptp.mand (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.teach X) tptp.cs) __flatten_var_0)))) (@ (@ tptp.mand (@ (@ tptp.teach tptp.mary) tptp.psych)) (@ (@ tptp.teach tptp.sue) tptp.psych)))))))) (let ((_let_3 (= tptp.mexists_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (exists ((X $$unsorted)) (and (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))) (let ((_let_4 (= tptp.mforall_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (forall ((X $$unsorted)) (=> (@ (@ tptp.eiw_di X) W) (@ (@ A X) W))))))) (let ((_let_5 (= tptp.mdia (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ tptp.mrel W) V) (@ Phi V))))))) (let ((_let_6 (= tptp.mbox (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ tptp.mrel W) V) (@ Phi V))))))) (let ((_let_7 (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))) (let ((_let_8 (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))) (let ((_let_9 (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))) (let ((_let_10 (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))) (let ((_let_11 (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))) (let ((_let_12 (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))) (let ((_let_13 (ho_3 k_2 tptp.mactual))) (let ((_let_14 (ho_4 _let_13 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9))) (let ((_let_15 (forall ((X $$unsorted)) (or (not (ho_4 (ho_6 k_5 X) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)) (not (ho_4 (ho_6 (ho_8 k_7 X) tptp.cs) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)))))) (let ((_let_16 (not _let_15))) (let ((_let_17 (and (ho_4 (ho_6 (ho_8 k_7 tptp.john) tptp.math) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9) _let_16 (ho_4 (ho_6 (ho_8 k_7 tptp.mary) tptp.psych) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9) (ho_4 (ho_6 (ho_8 k_7 tptp.sue) tptp.psych) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9)))) (let ((_let_18 (not _let_14))) (let ((_let_19 (or _let_18 _let_17))) (let ((_let_20 (or _let_18 _let_16))) (let ((_let_21 (forall ((V tptp.mworld)) (or (not (ho_4 (ho_3 k_2 tptp.mactual) V)) (not (forall ((X $$unsorted)) (or (not (ho_4 (ho_6 k_5 X) V)) (not (ho_4 (ho_6 (ho_8 k_7 X) tptp.cs) V))))))))) (let ((_let_22 (not _let_20))) (let ((_let_23 (not _let_21))) (let ((_let_24 (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))) (ASSUME :args (_let_7)) (ASSUME :args (_let_8)) (ASSUME :args (_let_9)) (ASSUME :args (_let_10)) (ASSUME :args (_let_11)) (ASSUME :args (_let_12))))) (let ((_let_25 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO _let_24 :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((V tptp.mworld)) (or (not (@ (@ tptp.mrel tptp.mactual) V)) (not (forall ((X $$unsorted)) (or (not (@ (@ tptp.eiw_di X) V)) (not (@ (@ (@ tptp.teach X) tptp.cs) V)))))))) _let_23))))))) (let ((_let_26 (or))) (let ((_let_27 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_25) :args (_let_23))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_23) _let_21))) (REFL :args (_let_22)) :args _let_26)) _let_25 :args (_let_22 true _let_21)))) (let ((_let_28 (REFL :args (_let_20)))) (let ((_let_29 (not _let_17))) (let ((_let_30 (forall ((V tptp.mworld)) (or (not (ho_4 (ho_3 k_2 tptp.mactual) V)) (and (ho_4 (ho_6 (ho_8 k_7 tptp.john) tptp.math) V) (not (forall ((X $$unsorted)) (or (not (ho_4 (ho_6 k_5 X) V)) (not (ho_4 (ho_6 (ho_8 k_7 X) tptp.cs) V))))) (ho_4 (ho_6 (ho_8 k_7 tptp.mary) tptp.psych) V) (ho_4 (ho_6 (ho_8 k_7 tptp.sue) tptp.psych) V)))))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_2)) (TRANS (MACRO_SR_EQ_INTRO _let_24 :args (_let_2 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((V tptp.mworld)) (or (not (@ (@ tptp.mrel tptp.mactual) V)) (and (@ (@ (@ tptp.teach tptp.john) tptp.math) V) (not (forall ((X $$unsorted)) (or (not (@ (@ tptp.eiw_di X) V)) (not (@ (@ (@ tptp.teach X) tptp.cs) V))))) (@ (@ (@ tptp.teach tptp.mary) tptp.psych) V) (@ (@ (@ tptp.teach tptp.sue) tptp.psych) V)))) _let_30))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_18 _let_17 (not _let_19)))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_9 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (ho_4 _let_13 V) false))))) :args (_let_30))) _let_31 :args (_let_19 false _let_30)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_17 1)) :args ((or _let_16 _let_29))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_20 1)) (CONG _let_28 (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_15))) :args _let_26)) :args ((or _let_15 _let_20))) _let_27 :args (_let_15 true _let_20)) :args (_let_29 false _let_15)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_20 0)) (CONG _let_28 (MACRO_SR_PRED_INTRO :args ((= (not _let_18) _let_14))) :args _let_26)) :args ((or _let_14 _let_20))) _let_27 :args (_let_14 true _let_20)) :args (false false _let_19 true _let_17 false _let_14)) :args (_let_12 _let_11 _let_10 _let_9 _let_8 _let_7 _let_6 _let_5 (forall ((W tptp.mworld)) (@ (@ tptp.mrel W) W)) (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel W))) (=> (and (@ _let_1 U) (@ _let_1 V)) (@ (@ tptp.mrel U) V)))) (forall ((W tptp.mworld)) (exists ((X $$unsorted)) (@ (@ tptp.eiw_di X) W))) (forall ((W tptp.mworld) (V tptp.mworld) (X $$unsorted)) (let ((_let_1 (@ tptp.eiw_di X))) (=> (and (@ _let_1 W) (@ (@ tptp.mrel V) W)) (@ _let_1 V)))) _let_4 _let_3 _let_2 _let_1 true))))))))))))))))))))))))))))))))))
% 0.22/0.54 )
% 0.22/0.54 % SZS output end Proof for DAT334^23
% 0.22/0.54 % cvc5---1.0.5 exiting
% 0.22/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------